منابع مشابه
Perfect Constraints Are Tractable
By using recent results from graph theory, including the Strong Perfect Graph Theorem, we obtain a unifying framework for a number of tractable classes of constraint problems. These include problems with chordal microstructure; problems with chordal microstructure complement; problems with tree structure; and the “all-different” constraint. In each of these cases we show that the associated mic...
متن کاملAntiwebs are rank-perfect
We discuss a nested collection of three superclasses of perfect graphs: near-perfect, rank-perfect, and weakly rank-perfect graphs. For that we start with the description of the stable set polytope for perfect graphs and allow stepwise more general facets for the stable set polytopes of the graphs in each superclass. Membership in those three classes indicates how far a graph is away from being...
متن کاملJulia Sets Are Uniformly Perfect
We prove that Julia sets are uniformly perfect in the sense of Pommerenke (Arch. Math. 32 (1979), 192-199). This implies that their linear density of loganthmic capacity is strictly positive, thus implying that Julia sets are regular in the sense of Dinchlet. Using this we obtain a formula for the entropy of invanant harmonic measures on Julia sets. As a corollary we give a very short proof of ...
متن کاملPerfect graphs are kernel solvable
In this paper we prove that perfect graphs are kernel solvable, as it was conjectured by Berge and Duchet (1983). The converse statement, i.e. that kernel solvable graphs are perfect, was also conjectured in the same paper, and is still open. In this direction we prove that it is always possible to substitute some of the vertices of a non-perfect graph by cliques so that the resulting graph is ...
متن کاملSlightly triangulated graphs are perfect
A graph is triangulated if it has no chordless cycle with at least four vertices (8k 4; C k 6 6 G). These graphs have been generalized by R. Hayward with the weakly triangulated graphs (8k 5; C k ; C k 6 6 G). In this note we propose a new generalization of triangulated graphs. A graph G is slightly triangulated if it satisses the two following conditions : 1. G contains no chordless cycle with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 2005
ISSN: 0011-4642,1572-9141
DOI: 10.1007/s10587-005-0061-6